Fast Stippling based on Weighted Centroidal Voronoi Diagrams

نویسندگان

  • Eila Gómez
  • Elías Méndez
  • Germán Arroyo
  • Domingo Martín
چکیده

Stippling is an artistic technique that has been used profusely in antiquity. One of the main problems is that it requires great skill and patience to achieve excellent results due to the large number of points that must be drawn even for small formats. The use of computers, in general, and GPUs, in particular, with their computing capacity, has allowed to overcome many of these limits. We present a real-time GPU stippling program that combines the advantages of positioning based on Weighted Centroidal Voronoi Diagrams and the realistic aspect of the scanned points. CCS Concepts • Computer graphics → Non-photorealistic rendering;

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Mesh Coarsening based upon Multiplicatively Weighted Centroidal Voronoi Diagrams

An approximated Centroidal Voronoi Diagram (CVD) construction provides an efficient and fast way for coarsening polygonal meshes. In this article a new generalization of the CVD for 3D meshes is presented a Multiplicatively Weighted Centroidal Voronoi Diagram. Based on this concept we propose a mesh coarsening algorithm which is intended to capture the mesh features as good as possible. To achi...

متن کامل

Video Stippling

In this paper, we consider rendering color videos using a non-photo-realistic art form technique commonly called stippling. Stippling is the art of rendering images using point sets, possibly with various attributes like sizes, elementary shapes, and colors. Producing nice stippling is attractive not only for the sake of image depiction but also because it yields a compact vectorial format for ...

متن کامل

Fast Voronoi Diagrams and O sets on Triangulated Surfaces

We apply the Fast Marching Method on triangulated domains to e ciently compute Voronoi diagrams and o set curves on triangulated manifolds. The computational complexity of the proposed algorithm is optimal, O(M logM), where M is the number of vertices. The algorithm also applies to weighted domains in which a di erent cost is assigned to each surface point.

متن کامل

Computing Voronoi Treemaps: Faster, Simpler, and Resolution-independent

Voronoi treemaps represent hierarchies as nested polygons. We here show that, contrary to the apparent popular belief, utilization of an algorithm for weighted Voronoi diagrams is not only feasible, but also more efficient than previous low-resolution approximations, even when the latter are implemented on graphics hardware. More precisely, we propose an instantiation of Lloyd’s method for cent...

متن کامل

Multiple Covers with Balls II: Weighted Averages

Voronoi diagrams and Delaunay triangulations have been extensively used to represent and compute geometric features of point configurations. We introduce a generalization to poset diagrams and poset complexes, which contain order-k and degree-k Voronoi diagrams and their duals as special cases. Extending a result of Aurenhammer from 1990, we show how to construct poset diagrams as weighted Voro...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017